A Decomposition Method for Jobshop Scheduling
نویسندگان
چکیده
منابع مشابه
Jobshop Scheduling in a Shipyard
Jobshop scheduling is considered a standard problem to solve by means of Genetic Algorithms (GA) and a number of articles have been written about this subject [3]. In spite of this, only few applications of GA have been published [2] on real jobshop scheduling problems. Even though some applications may not be published for business related reasons, more practical applications seem necessary, i...
متن کاملA Dynamic Search Method for Jobshop Scheduling Using Lagrange Relaxation Method and Genetic Algorithm
This paper deals with an approximate solution method by decomposing a search space dynamically combined with genetic algorithm(GA) and Lagrangian relaxation(LR) method for solving a job-shop scheduling problem. In this method a subspace of a search space is constructed by using information on partial processing order relations between operations which use same resources. We search these subspac...
متن کاملJobshop Scheduling with task intervals
This paper presents a technique for scheduling based on sets of tasks. Used within a branch & bound algorithm, it cuts branches very eeciently. It is thus well adapted for proofs of optimality. This technique solves typical hard 10 10 problems within a few thousand backtracks and is also adapted to large problems. LA21, a 15 10 problem open since 1984 is solved and a new bound is given for LA29...
متن کاملImproving Branch and Bound for Jobshop Scheduling with Constraint Propagation
Task intervals were defined in [CL94] for disjunctive scheduling so that, in a scheduling problem, one could derive much information by focusing on some key subsets of tasks. The advantage of this approach was to shorten the size of search trees for branch&bound algorithms because more propagation was performed at each node. In this paper, we refine the propagation scheme and describe in detail...
متن کاملStudies on Metaheuristics for Jobshop and Flowshop Scheduling Problems
Preface Scheduling has been a subject of a significant amount of literature in the operations research field since the early 1950s. The main objective of scheduling is an efficient allocation of shared resources over time to competing activities. Emphasis has been on investigating machine scheduling problems where jobs represent activities and machines represent resources. The problem is not on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1991
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.27.607